ar X iv : c on d - m at / 9 80 11 33 v 1 1 4 Ja n 19 98 Remarks on “ COLORING RANDOM TRIANGULATION ”

ar X iv : g r - qc / 9 80 10 41 v 1 1 3 Ja n 19 98 MULTIDIMENSIONAL GRAVITY WITH P - BRANES

1 The model We consider the model governed by the action

ar X iv : c m p - lg / 9 80 10 01 v 1 1 4 Ja n 19 98 Hierarchical Non - Emitting Markov Models 1

We describe a simple variant of the interpolated Markov model with nonemitting state transitions and prove that it is strictly more powerful than any Markov model. More importantly, the non-emitting model outperforms the classic interpolated model on the natural language texts under a wide range of experimental conditions, with only a modest increase in computational requirements. The non-emitt...

ar X iv : c on d - m at / 9 40 10 66 v 1 2 8 Ja n 19 94 Ground state energy and quasiparticle gaps

ar X iv : c on d - m at / 9 80 63 27 v 1 2 6 Ju n 19 98 . Flow - Equations for the Model of Hybridized Bosons and Fermions

Using the flow-equations method we showed analytically the occurrence of dispersion for the local bosons in a model of hybridized of local bosons and fermions.

ar X iv : m at h / 04 10 33 5 v 2 [ m at h . C O ] 3 1 Ja n 20 05 HIGHER CONNECTIVITY OF GRAPH COLORING COMPLEXES

The main result of this paper is a proof of the following conjecture of Babson & Kozlov: Theorem. Let G be a graph of maximal valency d, then the complex Hom (G, Kn) is at least (n − d − 2)-connected. Here Hom (−,−) denotes the polyhedral complex introduced by Lovász to study the topological lower bounds for chromatic numbers of graphs. We will also prove, as a corollary to the main theorem, th...